A 2-Isomorphism Theorem for Hypergraphs
نویسندگان
چکیده
منابع مشابه
A 2-Isomorphism Theorem for Hypergraphs
One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press
متن کاملAn isomorphism theorem for digraphs
A seminal result by Lovász states that two digraphs A and B (possibly with loops) are isomorphic if and only if for every digraph X the number of homomorphisms X → A equals the number of homomorphisms X → B. Lovász used this result to deduce certain cancellation properties for the direct product of digraphs. We develop an analogous result for the class of digraphs without loops, and with weak h...
متن کاملA First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. Since \natural" complete problems seem to stay complete via fops, this indicates that up to rst-order isomorphism there is only one \natural" complete problem for each \...
متن کاملToward a Hajnal-Szemerédi theorem for hypergraphs
Let H be a triple system with maximum degree d > 1 and let r > 107 √ d log d. Then H has a proper vertex coloring with r colors such that any two color classes differ in size by at most one. The bound on r is sharp in order of magnitude apart from the logarithmic factors. Moreover, such an r-coloring can be found via a randomized algorithm whose expected running time is polynomial in the number...
متن کاملMantel's theorem for random hypergraphs
A cornerstone result in extremal graph theory is Mantel’s Theorem, which states that every maximum triangle-free subgraph of Kn is bipartite. A sparse version of Mantel’s Theorem is that, for sufficiently large p, every maximum triangle-free subgraph of G(n, p) is w.h.p. bipartite. Recently, DeMarco and Kahn proved this for p > K √ log n/n for some constant K, and apart from the value of the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1997
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1789